ORNL/TM-11850 Engineering Physics and Mathematics Division Mathematical Sciences Section ON FINDING MINIMUM-DIAMETER CLIQUE TREES
نویسندگان
چکیده
It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). Since some chordal graphs have many distinct clique tree representations, it is interesting to consider which one is most desirable under various circumstances. A clique tree of minimum diameter (or height) is sometimes a natural candidate when choosing clique trees to be processed in a parallel computing environment. This paper introduces a linear time algorithm for computing a minimumdiameter clique tree. The new algorithm is an analogue of the natural greedy algorithm for rooting an ordinary tree in order to minimize its height. It has potential application in the development of parallel algorithms for both knowledge-based systems and the solution of sparse linear systems of equations.
منابع مشابه
Comparison of Radon (222Rn) and Thoron (220Rn) Gamma Dosimetry in the Environment Using the ORNL Mathematical Phantom
Background: The potential hazards of exposure to radiation from radon have been of great concern worldwide, as it is associated with an increased risk of lung cancer. Radon (222Rn) and its progeny are the main sources of radioactivity in the environment. The half-life of 222Rn (3.82 days) is long enough for it to diffuse into and build up in homes. 220Rn or thoron from the 232Th series, and 219...
متن کاملOn Finding Minimum-Diameter Clique Trees
It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). Since some chordal graphs have many distinct clique tree representations, it is interesting to consider which one is most desirable under various circumstances. A clique tree of minimum diameter (or height) is sometimes a natural candidate when choosing clique trees to be processed in a ...
متن کاملSOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH
In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...
متن کاملComputing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملORNL TM Engineering Physics and Mathematics Division Mathematical Sciences Section PARALLELIZING THE SPECTRAL TRANSFORM METHOD PART II
The spectral transform method is a widely used numerical technique for solving partial di erential equations on the sphere in global climate modeling This paper describes the parallelization and performance of the spectral method for solving the nonlinear shallow water equations on the surface of a sphere using a node Intel iPSC hypercube Solving the shallow water equations represents a computa...
متن کامل